QR factorization with complete pivoting and accurate computation of the SVD
نویسنده
چکیده
A new algorithm of Demmel et al. for computing the singular value decomposition (SVD) to high relative accuracy begins by computing a rank-revealing decomposition (RRD). Demmel et al. analyse the use of Gaussian elimination with complete pivoting (GECP) for computing the RRD. We investigate the use of QR factorization with complete pivoting (that is, column pivoting together with row sorting or row pivoting) as an alternative to GECP, since this leads to a faster SVD algorithm. We derive a new componentwise backward error result for Householder QR factorization and combine it with the theory of Demmel et al. to show that high relative accuracy in the computed SVD can be expected for matrices that are diagonal scalings of a well-conditioned matrix. An a posteriori error bound is derived that gives useful estimates of the relative accuracy of the computed singular values. Numerical experiments confirm the theoretical predictions. © 2000 Elsevier Science Inc. All rights reserved. AMS classification: 65F20; 65G05
منابع مشابه
Umist Qr Factorization with Complete Pivoting and Accurate Computation of the Svd Departments of Mathematics
متن کامل
Complete pivoting strategy for the $IUL$ preconditioner obtained from Backward Factored APproximate INVerse process
In this paper, we use a complete pivoting strategy to compute the IUL preconditioner obtained as the by-product of the Backward Factored APproximate INVerse process. This pivoting is based on the complete pivoting strategy of the Backward IJK version of Gaussian Elimination process. There is a parameter $alpha$ to control the complete pivoting process. We have studied the effect of dif...
متن کاملPreconditioning in the Parallel Block - Jacobi Svd Algorithm ∗
One way, how to speed up the computation of the singular value decomposition of a given matrix A ∈ Cm×n, m ≥ n, by the parallel two-sided block-Jacobi method, consists of applying some pre-processing steps that would concentrate the Frobenius norm near the diagonal. Such a concentration should hopefully lead to fewer outer parallel iteration steps needed for the convergence of the entire algori...
متن کاملParallel One-Sided Block Jacobi SVD Algorithm: II. Implementation
This technical report is devoted to the description of implementation details of the accelerated parallel one-sided block Jacobi SVD algorithm, whose analysis and design was described in [21]. We provide discuss a suitable data layout for a parallel implementation of the algorithm on a parallel computer with distributed memory. This discussion is complicated by the fact that different computati...
متن کاملOn Data Layout in the Parallel Block-jacobi Svd Algorithm with Pre–processing
An efficient version of the parallel two-sided block-Jacobi algorithm for the singular value decomposition of an m × n matrix A includes the pre-processing step, which consists of the QR factorization of A with column pivoting followed by the optional LQ factorization of the Rfactor. Then the iterative two-sided block-Jacobi algorithm is applied in parallel to the R-factor (or L-factor). Having...
متن کامل